On the approximation of the generalized capacitated tree-routing problem
نویسندگان
چکیده
منابع مشابه
On the approximation of the generalized capacitated tree-routing problem
Let G=(V,E) be a connected graph such that each edge e in E is weighted by a nonnegative real w(e). Let s be a vertex designated as a sink, M subset of V be a set of terminals with a demand function q:MR +, k>0 be a routing capacity, and λ≥1 be an integer edge capacity. The capacitated tree-routing problem (CTR) asks to find a partition M={Z 1,Z 2,...,Z l } of M and a set T={T1,T2,...,Tl} of tr...
متن کاملApproximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s ∈ V and a set M ⊆ V − {s} of terminals with a nonnegative demand q(v), v ∈ M , we wish to find a collection T = {T1, T2, . . . , T`} of trees rooted at s to send all the demands to s, where the total demand collected by each tree Ti...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولAn Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
The Capacitated Multicast Tree Routing Problem is considered, in which only a limitednumber of destination nodes are allowed to receive data in one routing tree and multiple routingtrees are needed to send data from the source node to all destination nodes. The goal is to min-imize the total cost of these routing trees. An improved approximation algorithm is presented,which has ...
متن کاملA 3.4713-approximation algorithm for the capacitated multicast tree routing problem
Given an underlying communication network represented as an edge-weight graph G = (V,E), a source node s ∈ V , a set of destination nodes D ⊆ V , and a capacity k which is a positive integer, the capacitated multicast tree routing problem asks for a minimum cost routing scheme for source s to send data to all destination nodes, under the constraint that in each routing tree at most k destinatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2010
ISSN: 1570-8667
DOI: 10.1016/j.jda.2009.08.002